Hardness of the Maximum Union-of-Closures Problem

The maximum closure problem of a vertex-weighted directed graph is a classical optimization problem. Motivated by image segmentation and data mining applications, we consider a variant that computes the maximum union of closures of two different graphs on a shared vertex set. We show that the problem is NP-hard to approximate within a bounded approximation ratio even for trees.